Group Re - keying Protocol Based on Modular Polynomial Arithmetic Over Galois Field
نویسنده
چکیده
Problem statement: In this study we propose a group re-keying protocol based on modular polynomial arithmetic over Galois Field GF(2). Common secure group communications requires encryption/decryption for group re-keying process, especially when a group member is leaving the group. Approach: This study proposes secret keys multiplication protocol based on modular polynomial arithmetic (SKMP), which eliminates the need for the encryption/decryption during the group re-keying. Results: The implementation based on modular polynomial arithmetic over Galois Field GF(2) offers fast re-keying process (about 50% faster than Secret Keys Multiplication Protocol (SKM) for 128 bit key) and compact key size representation against other secret keys multiplication protocols. With SKMP group re-keying is handled more efficiently through modular polynomial arithmetic manipulation rather than the expensive encryption/encryption which need to be done on every membership change.
منابع مشابه
Reverse engineering of irreducible polynomials in GF(2m) arithmetic
Current techniques for formally verifying circuits implemented in Galois field (GF ) arithmetic are limited to those with a known irreducible polynomial P (x). This paper presents a computer algebra based technique that extracts the irreducible polynomial P (x) used in the implementation of a multiplier in GF(2). The method is based on first extracting a unique polynomial in Galois field of eac...
متن کاملDeformation of Outer Representations of Galois Group II
This paper is devoted to deformation theory of "anabelian" representations of the absolute Galois group landing in outer automorphism group of the algebraic fundamental group of a hyperbolic smooth curve defined over a number-field. In the first part of this paper, we obtained several universal deformations for Lie-algebra versions of the above representation using the Schlessinger criteria for...
متن کاملDeformation of Outer Representations of Galois Group
To a hyperbolic smooth curve defined over a number-field one naturally associates an "anabelian" representation of the absolute Galois group of the base field landing in outer automorphism group of the algebraic fundamental group. In this paper, we introduce several deformation problems for Lie-algebra versions of the above representation and show that, this way we get a richer structure than t...
متن کاملEfficient Gröbner Basis Reductions for Formal Verification of Galois Field Arithmetic Circuits
Galois field arithmetic is a critical component in communication and security-related hardware, requiring dedicated arithmetic circuit architectures for greater performance. In many Galois field applications, such as cryptography, the datapath size in the circuits can be very large. Formal verification of such circuits is beyond the capabilities of contemporary verification techniques. This pap...
متن کاملArithmetic Teichmuller Theory
By Grothedieck's Anabelian conjectures, Galois representations landing in outer automorphism group of the algebraic fundamental group which are associated to hyperbolic smooth curves defined over number fields encode all arithmetic information of these curves. The goal of this paper is to develope and arithmetic teichmuller theory, by which we mean, introducing arithmetic objects summarizing th...
متن کامل